package practice1_100;

public class Practice5Copy {
    public String longestPalindrome(String s){
        char[] chars=s.toCharArray();
        boolean[][] dpTable =new boolean[s.length()][s.length()];
        for (int i = 0; i < s.length(); i++) {
            dpTable[i][i]=true;//每单个的字符肯定是回文串
        }
        for (int i = 0; i < s.length(); i++) {
            for (int j = 0; j < s.length(); j++) {
                    dpTable[i][j]=dpTable[i][j-1];
            }
        }
        return "";
    }
}
